Rapid Demonstration of Linear Relations Connected by Boolean Operators
نویسنده
چکیده
Note: The last sentence on page 3 is not entirely accurate, in that only the number of multiplications decreases by a factor of j; the number of squarings is unaaected. Abstract. Consider a polynomial-time prover holding a set of secrets. We describe how the prover can rapidly demonstrate any satissable boolean formula for which the atomic propositions are relations that are linear in the secrets, without revealing more information about the secrets than what is conveyed by the formula itself. Our protocols support many proof modes, and are as secure as the Discrete Logarithm assumption or the RSA/factoring assumption.
منابع مشابه
A comparative study of fuzzy norms of linear operators on a fuzzy normed linear spaces
In the present paper, we rst modify the concepts of weakly fuzzy boundedness, strongly fuzzy boundedness, fuzzy continuity, strongly fuzzy continuity and weakly fuzzy continuity. Then, we try to nd some relations by making a comparative study of the fuzzy norms of linear operators.
متن کاملON FELBIN’S-TYPE FUZZY NORMED LINEAR SPACES AND FUZZY BOUNDED OPERATORS
In this note, we aim to present some properties of the space of all weakly fuzzy bounded linear operators, with the Bag and Samanta’s operator norm on Felbin’s-type fuzzy normed spaces. In particular, the completeness of this space is studied. By some counterexamples, it is shown that the inverse mapping theorem and the Banach-Steinhaus’s theorem, are not valid for this fuzzy setting. Also...
متن کاملDefining relations of a group $Gamma= G^{3,4}(2,Z)$ and its action on real quadratic field
In this paper, we have shown that the coset diagrams for the action of a linear-fractional group $Gamma$ generated by the linear-fractional transformations $r:zrightarrow frac{z-1}{z}$ and $s:zrightarrow frac{-1}{2(z+1)}$ on the rational projective line is connected and transitive. By using coset diagrams, we have shown that $r^{3}=s^{4}=1$ are defining relations for $Gamma$. Furt...
متن کاملRelationships between Boolean Functions and Symmetric Groups
We study the relations between boolean functions and symmetric groups. We consider elements of a symmetric group as variable transformation operators for boolean functions. Boolean function may be xed or permuted by these operators. We give some properties relating the symmetric group Sn and boolean functions on Vn.
متن کاملOptimization of Boolean expressions for main memory database systems
With the ubiquity of main memory databases which are increasingly replacing the old disk-oriented databases, relations are being stored in denormalized form in order to increase the query throughput, thus, the dominance of join operators in terms of costs is being replaced by the costs of evaluating selection predicates. Boolean expressions containing selection predicates connected both conjunc...
متن کامل